An Imitation and Heuristic Method for Scheduling with Subcontracted Resources
نویسندگان
چکیده
A scheduling problem with subcontracted resources is widely spread and associated the distribution of limited renewable non-renewable resources, both own ones based on work’s due dates earliest start time. Scheduling’s goal to reduce cost resources. In paper, application a few methods theory optimization algorithm considered; limitations these methods’ are highlighted. It shown that use simulation modeling heuristic rules for allocation makes it possible overcome identified limitations. new imitation method solving assigned proposed. The comparison existing in terms quality found solution performance carried out. case study presented allowed four-fold reduction overall real project portfolio.
منابع مشابه
Heuristic Method for Optimum Shift Scheduling Design
This paper describes a method to schedule shifts in the most optimum way desire for today’s cost sensitive industries. The main problem for this domain is to make sure all shifts are assigned to cover all or maximum jobs available. The shifts also need to be schedule with the least manpower possible, avoid manpower idling during the shift and take into consideration employee’s time adaptability...
متن کاملDecomposition Method for Project Scheduling with Spatial Resources
Project scheduling problems are in practice often restricted by a limited availability of spatial resources. In this paper we develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Spatial Resources. Spatial resources are resources that are not required by single activities, but by activity groups. As soon as an activity of such a group starts, the spati...
متن کاملHeuristic Planning with Resources
1 Aristotle University, Dept. of Informatics, 54006, Thessaloniki, Greece, email: {yrefanid, vlahavas}@csd.auth.gr Abstract. This paper presents GRT-R, an enhanced version of the GRT planner capable of explicitly handling resources. GRT is a domain independent heuristic STRIPS planner, which works in the space of the states. The heuristic computes off-line, in a preprocessing phase, estimates f...
متن کاملan efficient meta-heuristic algorithm for project scheduling with multiple modes
in this paper, a fully informed particle swarm (fips) algorithm is proposed for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. in the proposed fips, a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mod...
متن کاملAn improved heuristic for permutation flowshop scheduling
Flowshop scheduling deals with determination of optimum sequence of jobs to be processed on some machines in a fixed order so as to satisfy certain scheduling criteria. The general problem of scheduling has been shown to be NP-complete. Exact algorithms, such as integer programming and branch-and-bound, guarantee optimality but do not yield the optimum solution in polynomial time even for probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9172098